An improved approximation algorithm for k-median problem using a new factor-revealing LP
نویسندگان
چکیده
The k-median problem is a well-known strongly NP-hard combinatorial optimization problem of both theoretical and practical significance. The previous best approximation ratio for this problem is 2.611+ǫ (Bryka et al. 2014) based on an (1, 1.95238219) bi-factor approximation algorithm for the classical facility location problem (FLP). This work offers an improved algorithm with an approximation ratio 2.592 + ǫ based on a new (1, 1.93910094) bi-factor approximation algorithm for the FLP.
منابع مشابه
Constant-Factor Approximation for Ordered k-Median
We study the Ordered k-Median problem, in which the solution is evaluated by first sorting the client connection costs and then multiplying them with a predefined non-increasing weight vector (higher connection costs are taken with larger weights). Since the 1990s, this problem has been studied extensively in the discrete optimization and operations research communities and has emerged as a fra...
متن کاملConstant Approximation for k-Median and k-Means with Outliers via Iterative Rounding
In this paper, we present a new iterative rounding framework for many clustering problems. Using this, we obtain an (α1 + ≤ 7.081 + )-approximation algorithm for k-median with outliers, greatly improving upon the large implicit constant approximation ratio of Chen [16]. For k-means with outliers, we give an (α2 + ≤ 53.002 + )-approximation, which is the first O(1)-approximation for this problem...
متن کاملConstant Approximation for Capacitated k-Median with (1 + ε)-Capacity Violation
We study the Capacitated k-Median problem for which existing constant-factor approximation algorithms are all pseudo-approximations that violate either the capacities or the upper bound k on the number of open facilities. Using the natural LP relaxation for the problem, one can only hope to get the violation factor down to 2. Li [SODA’16] introduced a novel LP to go beyond the limit of 2 and ga...
متن کاملConstant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation
We study the Capacitated k-Median problem for which existing constant-factor approximation algorithms are all pseudo-approximations that violate either the capacities or the upper bound k on the number of open facilities. Using the natural LP relaxation for the problem, one can only hope to get the violation factor down to 2. Li [SODA’16] introduced a novel LP to go beyond the limit of 2 and ga...
متن کاملImproved Combinatorial Algorithms for the Facility Location and k-Median Problems
We present improved combinatorial approximation algorithms for the uncapacitated facility location and k-median problems. Two central ideas in most of our results are cost scaling and greedy improvement. We present a simple greedy local search algorithm which achieves an approximation ratio of 2:414+ in ~ O(n= ) time. This also yields a bicriteria approximation tradeo of (1+ ; 1+ 2= ) for facil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1410.4161 شماره
صفحات -
تاریخ انتشار 2014